Snap-stabilizing committee coordination

Optimal Snap - Stabilizing Neighborood Synchronizerin

Snap-Stabilizing Detection of Cutsets

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we present a snap-stabilizing protocol which detects if a set of processors is a cutset of an arbitrary rooted network. This protocol is based on the depth-first search ( ) traversal and its properties. An interesting property of our protocol is that, despite the initial c...

Snap-Stabilizing Linear Message Forwarding

In this paper, we present the first snap-stabilizing message forwarding protocol that uses a number of buffers per node being independent of any global parameter, that is 4 buffers per link. The protocol works on a linear chain of nodes, that is possibly an overlay on a largescale and dynamic system, e.g., Peer-to-Peer systems, Grids. . . Provided that the topology remains a linear chain and th...

Concurrency in Snap-Stabilizing Local Resource Allocation

In distributed systems, resource allocation consists in managing fair access of a large number of processes to a typically small number of reusable resources. As soon as the number of available resources is greater than one, the efficiency in concurrent accesses becomes an important issue, as a crucial goal is to maximize the utilization rate of resources. In this paper, we tackle the concurren...

Snap-Stabilizing PIF Algorithm in Arbitrary Networks